On signpost systems and connected graphs
نویسندگان
چکیده
منابع مشابه
Modular and median signpost systems and their underlying graphs
The concept of a signpost system on a set is introduced. It is a ternary relation on the set satisfying three fairly natural axioms. Its underlying graph is introduced. When the underlying graph is disconnected some unexpected things may happen. The main focus are signpost systems satisfying some extra axioms. Their underlying graphs have lots of structure: the components are modular graphs or ...
متن کاملOn 3*-connected graphs
Menger's Theorem states that in a 3-connected graph, any two vertices are joined by three openly disjoint paths. Here we consider 3-connected cubic graphs where two vertices exist so that the three disjoint paths between them contain all of the vertices of the graph (we call these graphs 3*connected); and also where the latter is true for ALL pairs of vertices (globally 3*-connected). A necessa...
متن کاملOn k-chromatically connected graphs
A graph G is chromatically k–connected if every vertex cutset induces a subgraph with chromatic number at least k. Thus, in particular each neighborhood has to induce a k–chromatic subgraph. In [3], Godsil, Nowakowski and Nešetřil asked whether there exists a k–chromatically connected graph such that every minimal cutset induces a subgraph with no triangles. We show that the answer is positive ...
متن کاملSmoothed Analysis on Connected Graphs
The main paradigm of smoothed analysis on graphs suggests that for any large graph G in a certain class of graphs, perturbing slightly the edges of G at random (usually adding few random edges to G) typically results in a graph having much “nicer” properties. In this work we study smoothed analysis on trees or, equivalently, on connected graphs. Given an n-vertex connected graph G, form a rando...
متن کاملOn connected resolvability of graphs
For an ordered set W = {w1, w2, · · · , wk} of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the k-vector r(v|W ) = (d(v, w1), d(v, w2), · · · , d(v, wk)), where d(x, y) represents the distance between the vertices x and y. The set W is a connected resolving set for G if distinct vertices of G have distinct representations with respect to W and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2005
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-005-0022-0